A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120
نویسندگان
چکیده
A rate R = 5/20 hypergraph-based woven convolutional code with overall constraint length 67 and constituent convolutional codes is presented. It is based on a 3-partite, 3uniform, 4-regular hypergraph and contains rate R = 3/4 constituent convolutional codes with overall constraint length 5. Although the code construction is based on low-complexity codes, the free distance of this construction, computed with the BEAST algorithm, is dfree = 120, which is remarkably large.
منابع مشابه
Woven convolutional graph codes with large free distances
Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...
متن کاملAchieving Unequal Error Protection via Woven Codes: Construction and Analysis
In this paper several rate R = 2/5 convolutional encoding matrices with four states are used to illustrate how unequal error protection can be achieved for the different positions in the code sequences as well as in the information sequences. Free outputand input-distances and active burst outputand input-distances are computed. Typically a single code cannot combine a large free outputor input...
متن کاملWoven codes with outer warp: variations, design, and distance properties
In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...
متن کاملBinary Convolutional Codes of High Rate
The function N(r; ; dfree), defined as the maximum n such that there exists a binary convolutional code of block length n, dimension n r, constraint length , and free distance dfree, is studied. For dfree 2 f3; 4g, codes are obtained from simple constructions that determine N(r; ; dfree) for all positive integers and r. Codes with minimum Hamming distance dfree 5 are found by computer search. A...
متن کاملOn Permutor Design for Woven Convolutional Codes with Outer Warp
A permutor design for woven convolutional encoders with outer warp is introduced. All warp permutors are considered jointly, and for the overall design an approach similar to that of higher order separations for serially concatenated convolutional codes is applied. We present a bound on the minimum distance of a code generated by a woven convolutional encoder with outer warp and designed row pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 56 شماره
صفحات -
تاریخ انتشار 2010